A System with Template Answer Set Programs

نویسندگان

  • Francesco Calimeri
  • Giovambattista Ianni
  • Giuseppe Ielpa
  • Adriana Pietramala
  • Maria Carmela Santoro
چکیده

Although ASP systems have been extended in many directions, they still miss features which may be helpful towards industrial applications, like capabilities of quickly introduce new predefined constructs or to deal with compound data structures and module. We show here an implementation on top of the DLV system of DLP language, which features increased declarativity, code readability, compactness and reusability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disjunctive answer set solvers via templates

Answer set programming is a declarative programming paradigm oriented towards difficult combinatorial search problems. A fundamental task in answer set programming is to compute stable models, i.e., solutions of logic programs. Answer set solvers are the programs that perform this task. The problem of deciding whether a disjunctive program has a stable model is Σ2 -complete. The high complexity...

متن کامل

Answer Set Programming with Templates

The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures. We show how ASP can be extended with ‘template’ predicate’s definitions by introducing a wellsuited form of second order logics. We present language syntax and give its operational semantics. We show that the theory supporting o...

متن کامل

On Logic Programming with Aggregates

In this paper, we present a translational semantics for normal logic programs with aggregates. We propose two different translations of logic programs with aggregates into normal logic programs, whose answer set semantics is used to defined the semantics of the original programs. Differently from many of the earlier proposals in this area, our semantics does not impose any syntactic restriction...

متن کامل

Enhancing answer set programming with templates

The work aims at extending Answer Set Programming (ASP) with the possibility of quickly introducing new predefined constructs and to deal with compound data structures: we show how ASP can be extended with ‘template’ predicate’s definitions. We present language syntax and give its operational semantics. We show that the theory supporting our ASP extension is sound, and that program encodings ar...

متن کامل

A Meta-Programming Technique for Debugging Answer-Set Programs

Answer-set programming (ASP) is widely recognised as a viable tool for declarative problem solving. However, there is currently a lack of tools for developing answer-set programs. In particular, providing tools for debugging answer-set programs has recently been identified as a crucial prerequisite for a wider acceptance of ASP. In this paper, we introduce a meta-programming technique for debug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004